Edge-to-Edge Achieved Transfer Throughput Inference Using Link Utilization Counts
نویسندگان
چکیده
We propose a methodology to infer edge-to-edge achieved transfer throughput using link utilization counts. Our method treats variations in the link utilization time-series as possible transfer starting or ending events. Iteratively following these variations to the neighboring routers, we then identify the path the transfer traversed through the monitored network. Our evaluation shows that this method can identify events larger than 3 Mbit/sec and longer than 2 minutes in duration with more than 95% recall. Additionally, we show that event detection is strongly correlated with the traffic in the busiest router in the path. We discuss how a number of applications such as throughput prediction and DDoS attack source detection can use the inferred information. Keywords-throughput inference; edge-to-edge; SNMP; network performance monitoring.
منابع مشابه
Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملEvaluating Multipath TCP Resilience against Link Failures
Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...
متن کاملInfluence of Non-Uniform Wall Temperature on Local Heat Transfer Coefficient in a Rotating Square Channel
Abstract: This paper presents the results of an experimental examination of the effect of non-uniform wall temperature on local heat transfer coefficient in a rotating smooth-walled square channel. Three different thermal boundary situations were investigated: (a) even and odd (four) wall uniform temperature, (b) even and odd (four) wall uniform heat flux, and (c) even (leading and trailing) w...
متن کامل